Recovering non-negative and combined sparse representations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recovering non-negative and combined sparse representations

The non-negative solution to an underdetermined linear system can be uniquely recovered sometimes, even without imposing any additional sparsity constraints. In this paper, we derive conditions under which a unique non-negative solution for such a system can exist, based on the theory of polytopes. Furthermore, we develop the paradigm of combined sparse representations, where only a part of the...

متن کامل

On the uniqueness of non-negative sparse & redundant representations

We consider an underdetermined linear system of equations Ax = b with non-negative entries in A and b, and seek a non-negative solution x. We generalize known equivalence results for the basis pursuit, for an arbitrary matrix A, and an arbitrary monotone element-wise concave penalty replacing the `1-norm in the objective function. This result is then used to show that if there exists a sufficie...

متن کامل

Non-negative sparse coding

Non-negative sparse coding is a method for decomposing multivariate data into non-negative sparse components. In this paper we briefly describe the motivation behind this type of data representation and its relation to standard sparse coding and non-negative matrix factorization. We then give a simple yet efficient multiplicative algorithm for finding the optimal values of the hidden components...

متن کامل

Recovering sparse signals with non-convex penalties and DC programming

This paper considers the problem of recovering a sparse signal representation according to a signal dictionary. This problem is usually formalized as a penalized least-squares problem in which sparsity is usually induced by a l1-norm penalty on the coefficient. Such an approach known as the Lasso or Basis Pursuit Denoising has been shown to perform reasonably well in some situations. However, i...

متن کامل

Music Genre Classification Using Locality Preserving Non-Negative Tensor Factorization and Sparse Representations

A robust music genre classification framework is proposed that combines the rich, psycho-physiologically grounded properties of auditory cortical representations of music recordings and the power of sparse representation-based classifiers. A novel multilinear subspace analysis method that incorporates the underlying geometrical structure of the cortical representations space into non-negative t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Digital Signal Processing

سال: 2014

ISSN: 1051-2004

DOI: 10.1016/j.dsp.2013.11.003